#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"
using PII = pair<int, int>;
using TII = tuple<int, int, int>;
#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define BSI basic_string<int>
#define BSPI basic_string<PII>
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define VI vector<int>
#define VII vector<vector<int>>
#define VPII vector<PII>
#define lowbit(x) ((x)&(-x))
#define RE return;
#define RET return true;
#define REF return false;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define fi first
#define se second
#define sz size()
constexpr int N = 10 + 10;
constexpr int mod = 998244353;

int __FAST_IO__ = [](){
    ios::sync_with_stdio(0), cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(12);
    return 0;
}();

int tot,n;
int w[N][N];
int sx[N],sy[N];
int ans;

void dfs(int x,int y){
    
    if(x==n+1&&y==1){
        FOR(i,1,n){
            if(sy[i]!=tot||sx[i]!=tot){
                RE;
            }
        }
        ans++;
        RE;
    }

    FOR(i,0,min(tot-sx[x],tot-sy[y])){
        sx[x]+=i;
        sy[y]+=i;
        if(y==n&&sx[x]!=tot){
            sx[x]-=i;
            sy[y]-=i;
            continue;
        }

        if(x==n&&sy[y]!=tot){
            sx[x]-=i;
            sy[y]-=i;
            continue;
        }
        
        if(y<n){
            dfs(x,y+1);
        }else{
            dfs(x+1,1);
        }
        sx[x]-=i;
        sy[y]-=i;
    }
}

void solve() {
    cin>>tot>>n;

    dfs(1,1);

    cout<<ans<<endl;
}

signed main() {
    int Task = 1;
    for (; Task; Task--) {
        solve();
    }
    return 0;
}